Lower Bounds Against Non-Commutative Models Of Algebraic Computation

Lower Bounds Against Non-Commutative Models of Algebraic Computation

Simons Institute

STOC 2022 – Set-multilinear and non-commutative formula lower bounds

Non-commutative computations: lower bounds and polynomial identity testing by Guillaume Malod

matsciencechannel

Srikanth Srinivasan : Lower bounds for non-commutative skew circuits

matsciencechannel

Lower Bounds in Arithmetic Circuit Complexity II

Simons Institute

Session 1B - Semi-Algebraic Proofs, IPS Lower Bounds and the τ-Conjecture

Association for Computing Machinery (ACM)

Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits I... - Srikanth Srinivasan

Institute for Advanced Study

Ben Lee Volk: Recent lower bounds in algebraic complexity theory

Nutan Limaye: Superpolynomial lower bounds against low-depth algebraic circuits

The Complexity of the Non-commutative Determinant - Srikanth Srinivasan

Institute for Advanced Study

STOC24 8 A 4 Functional Lower Bounds in Algebraic Proofs Symmetry, Lifting, and Barriers

Non-commutative arithmetic computation - Avi Wigderson

Institute for Advanced Study

Lower Bounds in Arithmetic Circuit Complexity I

Simons Institute

Superpolynomial lower bounds against low-depth algebraic circuits - Nutan Limaye

CSAChannel IISc

Iddo Tzameret: Characterizing Propositional Proofs as Non-commutative Formulas

An exponential lower Bound against depth five powering circuits by Raghavendra Rao

matsciencechannel

Formal Series and Non-Commutative Computations

Simons Institute

Proof Complexity Lower Bounds from Algebraic Circuit Complexity - Forbes

Institute for Advanced Study

Sébastien Tavenas - Superpolynomial lower bounds against low-depth algebraic circuits

Avi Wigderson: "Proving Algebraic Identities"

Joint Mathematics Meetings